Method and system for determining the position of an object

ABSTRACT

A method and system for determining the location of an object. The system may implement a number of sensors at different locations that are positioned to receive a transmitted or reflected signal from the object. Also disclosed is a system and method of calculating object position based upon the time difference of arrival (TDOA) from each sensor, or the relative time difference of arrival (RTDOA).

FIELD OF THE INVENTION

The invention relates to a system and method for determining the position of an object using a frequency based sensor system (e.g., radar, sonar, global positioning satellites (GPS), cellular telephony, etc.).

BACKGROUND OF THE INVENTION

Accurately determining the position of moving objects, such as aircraft, missiles, land-vehicles, watercraft, and electronic devices (e.g., mobile telephones) has been a challenge for sometime. There have been many methods developed, including radar, sonar, GPS and other frequency based techniques.

Typically, object location systems make use of multilateration techniques (i.e., the fixing of a position by the time difference of arrival (TDOA) of a signal at a sensor) to locate the origin of a transmitted signal. TDOA information is typically based on signal arrival-time measurements from an object that transmits, reflects or receives and re-transmits a signal that is received at receiving sensors. The TDOA measurements and other sensor information is typically transmitted to a central processor for processing.

Methods for estimating position using TDOA are known. For example, “A Simple and Efficient Estimator for Hyperbolic Location” by Y. T. Chan and K. C. Ho. (IEEE Transactions on Signal processing, Vol. 42, No. 8, August 1994, pp. 1905-1915), which is incorporated herein by reference, provides techniques for implementing TDOA measurements.

Other methods for determining the location and identification of a object are also known. For example, U.S. Pat. No. 6,211,811, issued to Evers, discloses a method and apparatus for improving the surveillance coverage and object identification in a radar based surveillance system.

Another known method is disclosed in U.S. Pat. No. 6,201,499, issued to Hawkes et al. As disclosed therein, it is known to provide a method and apparatus for measuring the time difference of arrival between two received signals, each received signal being a time delayed version of a transmitted signal as intercepted at two different sensors where the transmitted signal is generated by a radio frequency transmitter.

Many drawbacks are present in existing systems and methods. For example, known systems and methods are often inaccurate and costly to implement. Other drawbacks also exist.

SUMMARY OF THE INVENTION

The present invention provides systems and methods for enabling computations that can be used to determine the position of a object using signal data at multiple sensors. Signal data may comprise any of Time of Arrival (TOA) data, Time Difference of Arrival (TDOA) data and Relative Time of Arrival (RTOA) data. These computations serve as an aid in the development position locating systems such as next generation air traffic control radar systems or the like.

Accordingly, there is provided a method for determining the position of an object in a system comprising multiple sensors arranged at differing heights and including a reference sensor. In some embodiments the method may comprise transmitting or reflecting a signal from a object and then determining the time of transmission or reflection of the signal from the object. The method may then include receiving the transmitted or reflected signal at the multiple sensors and determining the TOA of the signal at each sensor. A processor-based calculator may calculate a slant range from the object to each sensor and a processor based calculator may calculate a position vector of the object.

In accordance with some embodiments of the invention, there is provided a method for determining the position of a object in a system comprising multiple sensors arranged at differing heights and including a reference sensor. According to these embodiments, the method may comprise transmitting or reflecting a signal from a object and determining the time of transmission or reflection of the signal from the object. The method also includes receiving the transmitted or reflected signal at the multiple sensors and determining the TDOA of the signal at each sensor. Then, processor based calculators may be used to calculate a slant range from the object to each sensor and to calculate a position vector for the object.

In accordance with some other embodiments of the invention there is provided a method for determining the position of an object in a system comprising a sensor arranged at a determinable location and a secondary surveillance device that, at a determinable transmission time, transmits an interrogator signal that is reflected off the object, or received and retransmitted by the object, to a secondary sensor. In these embodiments the method may comprise obtaining a time of arrival for a signal received at the sensor and obtaining a secondary time of arrival for the reflected or retransmitted interrogator signal received at the secondary sensor. The method may also include implementing a processor-based calculator to calculate a slant range from the object to the sensor based, at least in part, upon the obtained time of arrival at the sensor and to calculate a secondary slant range from the object to the secondary sensor based, at least in part, upon the obtained secondary time of arrival at the secondary sensor. Finally, a processor-based calculator may be implemented to determine a position vector based, at least in part upon the transmission time of the interrogator signal, the calculated slant range and the calculated secondary slant range.

In accordance with some other embodiments of the invention there is provided a method for determining the position of an object in a system comprising a sensor arranged at a determinable location. In these embodiments, the method may comprise obtaining a time of arrival for a signal received at the sensor. Then a processor based calculator may calculate a slant range from the object to the sensor based, at least in part, upon the obtained time of arrival. Finally a processor based calculator may enable a determination of a position vector based, at least in part, upon the calculated slant range and the location of the sensor.

In accordance with some other embodiments of the invention there is provided a method for determining the position of an object in a system comprising a sensor arranged at a determinable location and a reference sensor. In these embodiments the method may comprise obtaining a time difference of arrival for a signal received at the sensor with respect to a signal received at the reference sensor and implementing a processor based calculator to calculate a slant range from the object to the sensor based, at least in part, upon the obtained time difference of arrival. The method may also include enabling a processor based calculator to determine a position vector based, at least in part, upon the calculated slant range and the location of the sensor.

In accordance with some other embodiments of the invention there is provided a system for determining the position of an object. In these embodiments the system may comprise a sensor, arranged at a determinable location, that obtains a time of arrival for a signal received at the sensor and a secondary surveillance device that, at a determinable transmission time, transmits an interrogator signal that is reflected off the object, or received and retransmitted by the object, to a secondary sensor and obtains a secondary time of arrival for the reflected or retransmitted interrogator signal received at the secondary sensor. The system may also comprise a slant range calculator that calculates a slant range from the object to the sensor based, at least in part, upon the obtained time of arrival at the sensor and a secondary slant range calculator that calculates a secondary slant range from the object to the secondary sensor based, at least in part, upon the obtained secondary time of arrival at the secondary sensor. Finally, the system may comprise a position vector calculator that determines a position vector based, at least in part upon the transmission time of the interrogator signal, the calculated slant range and the calculated secondary slant range.

In accordance with some other embodiments of the invention, there is provided a system for determining the position of an object. In these embodiments the system may comprise a sensor arranged at a determinable location and a reference sensor, wherein a time difference of arrival is obtained for a signal received at the sensor with respect to a signal received at the reference sensor. The system may also comprise a slant range calculator that calculates a slant range from the object to the sensor based, at least in part, upon the obtained time difference of arrival and a position vector calculator that determines a position vector based, at least in part, upon the calculated slant range and the location of the sensor.

In accordance with some other embodiments of the invention there is provided a system for determining the position of an object. In these embodiments the system may comprise a sensor arranged at a determinable location wherein the sensor obtains a time of arrival for a signal received at the sensor and a slant range calculator that calculates a slant range from the object to the sensor based, at least in part, upon the obtained time of arrival. In addition, the system may comprise a position vector calculator that determines a position vector based, at least in part, upon the calculated slant range and the location of the sensor.

Other aspects and features of the invention are possible. The following is a description of some exemplary embodiments of the invention.

BRIEF DESCRIPTION OF THE DRAWINGS

The purpose and advantages of the present invention will be apparent to those of ordinary skill in the art from the following detailed description in conjunction with the appended drawings in which like reference characters are used to indicate like elements.

FIG. 1 is a schematic diagram showing an airborne object and a number of ground-based sensors according to some embodiments of the invention.

FIG. 2 is a three-dimensional schematic diagram showing an object and a number of sensors according to some embodiments of the invention.

FIG. 3 is a two-dimensional schematic diagram showing an object with five sensors according to some embodiments of the invention.

FIG. 4 is a plot of TOA computation error contours with three sensors according to one embodiment of the invention.

FIG. 5 is a plot of TOA computation error contours with four sensors according to one embodiment of the invention.

FIG. 6 is a plot of TOA computation error contours with five sensors according to one embodiment of the invention.

FIG. 7 is a three-dimensional TOA schematic diagram showing an object with five ground-based sensors according to one embodiment of the present invention.

FIG. 8 is a top-view of an error result for a three-dimensional TOA-based computation with four sensors in accordance with some embodiments of the invention.

FIG. 9 is a side-view of an error result for a three-dimensional TOA-based computation with four sensors in accordance with some embodiments of the invention.

FIG. 10 is a top-view of an error result for a three-dimensional TOA-based computation with five sensors in accordance with some embodiments of the invention.

FIG. 11 is a side-view of an error result for a three-dimensional TOA-based computation with five sensors in accordance with some embodiments of the invention.

FIG. 12 is a top-view of an error result for a three-dimensional TOA-based computation with six sensors in accordance with some embodiments of the invention.

FIG. 13 is a side-view of an error result for a three-dimensional TOA-based computation with six sensors in accordance with some embodiments of the invention.

FIG. 14(a) is a plot of TDOA computation error contours with three sensors according to one embodiment of the invention.

FIG. 14(b) is a plot of TDOA computation error contours with four sensors according to one embodiment of the invention.

FIG. 14(c) is a plot of TDOA computation error contours with five sensors according to one embodiment of the invention.

FIG. 15 is a top-view of an error result for a three-dimensional CH-TDOA-based computation with four sensors according to some embodiments of the invention.

FIG. 16 is a side-view of an error result for a three-dimensional CH-TDOA-based computation with four sensors according to some embodiments of the invention.

FIG. 17 is a top-view of an error result for a three-dimensional CH-TDOA-based computation with five sensors according to some embodiments of the invention.

FIG. 18 is a side-view of an error result for a three-dimensional CH-TDOA-based computation with five sensors according to some embodiments of the invention.

FIG. 19 is a top-view of an error result for a three-dimensional CH-TDOA-based computation with six sensors according to some embodiments of the invention.

FIG. 20 is a side-view of an error result for a three-dimensional CH-TDOA-based computation with six sensors according to some embodiments of the invention.

FIG. 21 is a schematic timeline of signals transmitted to a sensor in accordance with some embodiments of the invention.

FIG. 22 is a schematic flow diagram of a method for computing object position in accordance with some embodiments of the invention.

FIG. 23 is a comparison of contour error plots for two-dimensional TOA, CH-TDOA and RTDOA computations with three sensors in accordance with some embodiments of the invention.

FIG. 24 is a comparison of contour error plots for two-dimensional TOA, CH-TDOA and RTDOA computations with four sensors in accordance with some embodiments of the invention.

FIG. 25 is a comparison of contour error plots for three-dimensional TOA, CH-TDOA and RTDOA computations with four sensors in accordance with some embodiments of the invention.

DETAILED DESCRIPTION OF THE INVENTION

The following description is intended to convey a thorough understanding of the invention by providing a number of specific embodiments and details. It should be understood, however, that the invention is not limited to these specific embodiments and details, which are provided for exemplary purposes only. It should be further understood that one possessing ordinary skill in the art, in light of known apparatuses and methods, would appreciate the use of the invention for its intended purposes and benefits in any number of alternative embodiments, depending upon specific design and other needs.

The present invention provides a relatively efficient and cost-effective method and apparatus for determining the location of an object. For example, FIG. 1 is a schematic representation of an embodiment of the invention wherein the position vector (i.e., the distance and angular orientation as measured from an origin) of an object 100 may be determined via information gathered at a number of sensors 102, 104, 106, 108.

As schematically indicated in FIG. 1, object 100 may comprise an aircraft, however, the invention is not so limited. Object 100 may comprise any object capable of being detected by the appropriate sensors (e.g., 102-108). For example, object 100 may comprise aircraft, missiles, spacecraft (e.g., space shuttles, satellites, etc.), land vehicles, watercraft, or the like. In addition, object 100 may comprise any type of electronic device capable of being detected by appropriate sensors (e.g., 102-108). For example, object 100 may comprise cellular telephones, paging devices, GPS receivers, wireless radio transmitters, or the like.

Similarly, while four sensors are shown in FIG. 1, the invention is not so limited. Any number of sensors may be used as is appropriate. In addition, the type of sensor may depend upon the type of position determining system being employed. For example, position determining systems like radar, sonar, GPS, cellular, etc., each employ appropriate types of sensors to detect the relevant signals.

It is also possible to practice the claimed invention in other configurations than the one shown in FIG. 1. For example, and as discussed in detail below, more or less sensors 102-108 may be employed in a variety of configurations. In addition, it is possible to use a mobile object location system wherein the system is contained, at least in part, in a spacecraft, aircraft, watercraft, or land-vehicle (e.g., MILSTAR satellite, AWACS or JSTARS aircraft, or similar ship-based or vehicle-based systems).

FIG. 2 is a schematic depiction of an object position detection system according to some embodiments of the invention. As shown in FIG. 2, system 200 may be configured in a 3-dimensional rectangular coordinate system. System 200 may comprise a number, M, of sensors arranged at differing axis coordinates. As shown in FIG. 2, for some embodiments it is preferable to use six sensors, 205(a), 205(b), 205(c), 205(d), 205(e), 205(f), positioned at various locations.

In operation, a transmitted, or reflected signal (not shown) from the object 203 is received by each of the sensors, 205(a), 205(b), 205(c), 205(d), 205(e), 205(f). In some embodiments, the time of arrival (TOA) for the signal from the object to each sensor is recorded for later use in processing. Assuming that the time of transmission, or reflection, from the object is also known, a slant range (i.e., the line of sight distance between two points, not at the same level relative to a specific datum) 204(a), 204(b), 204(c), 204(d), 204(e), 204(f) from the object 203 to each of the sensor 205(a), 205(b), 205(c), 205(d), 205(e), 205(f) can be calculated in the following manner: sr _(—)0_(in) =c(t _(—)0_(in) −t _(tgt))   (1)

for in=1, . . . ,M where

sr_(—)0_(in)=Slant range between each sensor in and object,

t_(—)0_(in)=Time of arrival,

t_(tgt)=Time of transmission or reflection,

c=Speed of light.

An example of a slant range can be described with reference to the example of an airborne radar object (e.g., an airplane flying at high altitude with respect to a radar antenna). In that example, the slant range is the hypotenuse of the triangle represented by the altitude of the airplane and the distance between the radar antenna and the airplane's ground track.

Because of possible delays and noise contamination of the received signal at each of the sensors 205(a), 205(b), 205(c), 205(d), 205(e), 205(f), errors may occur that may skew the accuracy of the TOA of the signal at each sensor. Therefore, in order to compensate for such an error, a known noise distribution (e.g., Gaussian noise) may be added to the TOA, yielding: t _(in) =t _(—)0_(in) +N(σ_(t))   (2)

where N(σ) denotes a Gaussian random number with variance of σ².

The slant range between sensor in and the object 203, with the added noise, may be determined by subtracting the TOA of the transmitted or reflected signal from object 203 to the already known time of transmission or reflection of the signal from the object 203 and multiplying it with the velocity of the signal (e.g., the speed of light (c)), yielding: r _(in) =c(t _(in) −t _(tgt)) r _(in) =c(t _(—)0_(in) +N(σ_(t))−t _(tgt)) r _(in) =c(t _(—)0_(in) −t _(tgt))++cN(σ_(t))   (3) r _(in) =sr _(—)0_(n) +N(σ_(t)) where σ_(r) =cσ _(t).   (4)

A position vector {right arrow over (P)}_(tgt)=[x_(tgt) y_(tgt) z_(tgt)]^(T) of the object 203 maybe calculated based on the TOA of the reflected or transmitted signal at each sensor t_(in), the slant range from the object to each sensor sr_(in) and the known position of each sensor (i.e., the determinable position vector {right arrow over (P)}s_(in) of each of the M sensors in the coordinate system) ${\overset{\rightarrow}{P}s_{i\quad n}} = \begin{bmatrix} x_{i\quad n} \\ y_{i\quad n} \\ z_{i\quad n} \end{bmatrix}$ for in=1, . . . ,M.

In some embodiments, a Lorentz inner product is used to calculate object position based on TOA information. Following that procedure, let {right arrow over (v)}₁ and {right arrow over (v)}₂ be a pair of 4-element vectors: ${{\overset{\rightarrow}{v}}_{1} = \begin{bmatrix} x_{1} \\ y_{1} \\ z_{1} \\ w_{1} \end{bmatrix}},{{\overset{\rightarrow}{v}}_{2} = {\begin{bmatrix} x_{2} \\ y_{2} \\ z_{2} \\ w_{2} \end{bmatrix}.}}$

Then, Lorentz inner product is then defined as <{right arrow over (v)} ₁ , {right arrow over (v)} ₂>_(L) =x ₁ x ₂ +y ₁ y ₂ +z ₁ z ₂ −w ₁ w ₂.

For each sensor in, the slant range can be expressed the following way: rd _(in) ² =c ²(t _(in) −t _(tgt))² =∥{right arrow over (P)}s _(in) −{right arrow over (P)} _(tgt)∥²=(x _(in) −x _(tgt))²+(y _(in) −y _(tgt))²+(z _(in) −z _(tgt))², or (x _(in) −x _(tgt))²+(y _(in) −y _(tgt))²+(z _(in) −z _(tgt))² −c ²(t _(in) −t _(tgt))²=0.

Reorganizing the equation gives: 2x _(in) x _(tgt)+2y _(in) y _(tgt)+2z _(in) z _(tgt)−2ct _(in) t _(tgt)=(x _(tgt) ² +y _(tgt) ² +z _(tgt) ² −c ² t _(tgt) ²)+(x _(in) ² +y _(in) ² +z _(in) ² −c ² t _(in) ²)

Let λ=x_(tgt) ²+y_(tgt) ²+z_(tgt) ²−c²t_(tgt) ², and organize the equations in=1, . . . , M as a line system so that 2·A·{right arrow over (v)}=λ·I _(—) v+{right arrow over (b)}

where ${A = \begin{bmatrix} x_{1} & y_{1} & z_{1} & {- {ct}_{1}} \\ \vdots & \vdots & \vdots & \vdots \\ x_{i\quad n} & y_{i\quad n} & z_{i\quad n} & {- {ct}_{i\quad n}} \\ \vdots & \vdots & \vdots & \vdots \\ x_{M} & y_{M} & z_{M} & {- {ct}_{M}} \end{bmatrix}},{\overset{\rightarrow}{v} = \begin{bmatrix} x_{tgt} \\ y_{tgt} \\ z_{tgt} \\ {ct}_{tgt} \end{bmatrix}},{{I\_ v} = \begin{bmatrix} 1 \\ \vdots \\ 1 \\ \vdots \\ 1 \end{bmatrix}},{\overset{\rightarrow}{b}\begin{bmatrix} {x_{1}^{2} + y_{1}^{2} + z_{1}^{2} - {c^{2}t_{1}^{2}}} \\ \vdots \\ {x_{i\quad n}^{2} + y_{i\quad n}^{2} + z_{i\quad n}^{2} - {c^{2}t_{{i\quad n}\quad}^{2}}} \\ \vdots \\ {x_{M}^{2} + y_{M}^{2} + z_{M}^{2} - {c^{2}t_{M}^{2}}} \end{bmatrix}}$

Depending on the value of M, the matrix A may or may not be a square matrix. Assuming that M≧4, the method of least squares is applied by multiplying both sides with A^(T) so that $\begin{matrix} {{2A^{T}A\overset{\rightarrow}{v}} = {{\lambda\quad A^{T}{I\_ v}} + {A^{T}\overset{\rightarrow}{b}}}} \\ {\overset{\rightarrow}{v} = {{\frac{1}{2}\left( {A^{T}A} \right)^{- 1}A^{T}{{I\_ v} \cdot \lambda}} + {\frac{1}{2}\left( {A^{T}A} \right)^{- 1}A^{T}\overset{\rightarrow}{b}}}} \\ {= {{\overset{\rightarrow}{d}\lambda} + \overset{\rightarrow}{e}}} \end{matrix}$ where ${\overset{\rightarrow}{d} = {\frac{1}{2}\left( {A^{T}A} \right)^{- 1}A^{T}{I\_ v}}},{\overset{\rightarrow}{e} = {\frac{1}{2}\left( {A^{T}A} \right)^{- 1}A^{T}{\overset{\rightarrow}{b}.}}}$

Taking the Lorentz inner product of {right arrow over (v)} with itself gives $\begin{matrix} {\lambda = {x_{tgt}^{2} + y_{tgt}^{2} + z_{tgt}^{2} + z_{tgt}^{2} - {c^{2}t_{tgt}^{2}}}} \\ {= \left\langle {\overset{\rightarrow}{v},\overset{\rightarrow}{v}} \right\rangle_{L}} \\ {{= \left\langle {{{\overset{\rightarrow}{d} \cdot \lambda} + \overset{\rightarrow}{e}},{{\overset{\rightarrow}{d} \cdot \lambda} + \overset{\rightarrow}{e}}} \right\rangle_{L}}{\lambda = {{\left\langle {\overset{\rightarrow}{d},\overset{\rightarrow}{d}} \right\rangle_{L}\lambda^{2}} + {2\left\langle {\overset{\rightarrow}{d},\overset{\rightarrow}{e}} \right\rangle_{L}\lambda} + {\left\langle {\overset{\rightarrow}{e},\overset{\rightarrow}{e}} \right\rangle_{L}.}}}} \end{matrix}$

This results in a quadratic equation with respect to λ: <{right arrow over (d)},{right arrow over (d)})_(L)λ²+(2<{right arrow over (d)},{right arrow over (e)}> _(L)−1)λ+<{right arrow over (e)},{right arrow over (e)}< _(L)=0.

Solving for λ gives $\lambda_{\pm} = {\frac{{- \left( {{2\left\langle {\overset{\rightarrow}{d},\overset{\rightarrow}{e}} \right\rangle_{L}} - 1} \right)} \pm \sqrt{\left( {{2\left\langle {\overset{\rightarrow}{d},\overset{\rightarrow}{e}} \right\rangle_{L}} - 1} \right)^{2} - {4\left\langle {\overset{\rightarrow}{d},\overset{\rightarrow}{d}} \right\rangle_{L}\left\langle {\overset{\rightarrow}{e},\overset{\rightarrow}{e}} \right\rangle_{L}}}}{2\left\langle {\overset{\rightarrow}{d},\overset{\rightarrow}{d}} \right\rangle_{L}}.}$

Once λ is calculated, {right arrow over (v)} is obtained by $\begin{bmatrix} x_{{tgt} \pm} \\ y_{{tgt} \pm} \\ z_{{tgt} \pm} \\ {c \cdot t_{{tgt} \pm}} \end{bmatrix} = {{\overset{\rightarrow}{v}}_{\pm} = {{\overset{\rightarrow}{d} \cdot \lambda_{\pm}} + {\overset{\rightarrow}{e}.}}}$

Now, two possible positions of the object are given by this computation. In order to choose the right solution, the following vectors are computed: ${r\_ ch}_{\pm} = {\begin{bmatrix} {{{\overset{\rightarrow}{P}s_{1}} - {\overset{\rightarrow}{P}}_{{tgt} \pm}}} \\ \vdots \\ {{{\overset{\rightarrow}{P}s_{i\quad n}} - {\overset{\rightarrow}{P}}_{{tgt} \pm}}} \\ \vdots \\ {{{\overset{\rightarrow}{P}s_{M}} - {\overset{\rightarrow}{P}}_{{tgt} \pm}}} \end{bmatrix} - {\begin{bmatrix} {sr}_{1} \\ \vdots \\ {sr}_{i\quad n} \\ \vdots \\ {sr}_{M} \end{bmatrix}.}}$

The vector with the smallest error norm of r_ch_(±) can be chosen as the correct position of the object.

An exemplary calculation of an object position vector is made with reference to FIG. 3. As shown in FIG. 3, a two-dimensional position location system 300, implementing a TOA based calculation, may comprise positioning four sensors (S₁) 305(b), (S₂) 305(c), (S₃) 305(d), (S₄) 305(e), and a reference sensor (S₅) 305(a) in a 20×20 mile 2-dimensional grid at locations given by the following sensor position ${{{vectors}\text{:}\quad\overset{\rightarrow}{P}s_{1}} = \begin{bmatrix} 15 \\ 10 \end{bmatrix}},{{\overset{\rightarrow}{P}s_{2}} = \begin{bmatrix} {- 15} \\ 10 \end{bmatrix}},{{\overset{\rightarrow}{P}s_{3}} = \begin{bmatrix} {- 15} \\ {- 10} \end{bmatrix}},{{\overset{\rightarrow}{P}s_{4}} = \begin{bmatrix} 15 \\ {- 10} \end{bmatrix}},{{\overset{\rightarrow}{P}s_{5}} = {\begin{bmatrix} 0 \\ 0 \end{bmatrix}.}}$

For calculation purposes, each grid node may be considered an object location. For each object position, the position vector calculation comprises estimating the position of the object for each sensor using slant range values at each sensor 305(b), 305(c), 305(d), 305(e), to compute the position of the object.

The above described system and TOA computation may be generalized so that it can be employed in a three dimensional (3-D) situation. In addition, the above system and TOA computation allows for the deployment of an unlimited number of sensors, so that a more accurate computation of the position of the object may be performed. Then, for each object position, the TOA computation may be used to estimate object position based on the noise added range data. In addition, a Monte-Carlo approach (or other numerical approximation method) may be employed to compute the standard deviation of the error between the true position of the object and the estimated position of the object. The standard deviation of Gaussian error added to the range may be σ_(r)=2.24×10⁻³, or some other suitable value.

Proceeding with the calculations for each of the sensors sensor 305(a), 305(b), 305(c), 305(d), 305(e), the slant range in can be expressed as: sr ² _(in) =c ²(t _(in) −t _(tgt))²   (5)

In terms of the positions of each sensor 305(a), 305(b), 305(c), 305(d), 305(e) and the position of the object at each position 303(a), 303(b), 303(c), 303(d), slant ranges 307(a), 307(b), 307(c), and 307(d) may be determined using the following relationship: sr ² _(in) =∥{right arrow over (P)}s _(in) −{right arrow over (P)} _(tgt)∥² sr ² _(in)=(x _(in) −x _(tgt))²+(y _(in) −y _(tgt))²+(z _(in) −z _(tgt))²   (6)

In other words, equation (6) may be re-written as:

(x_(in)−x_(tgt))²+(y_(in)−y_(tgt))²+(z_(in)−z_(tgt))²−c²(t_(in)−t_(tgt))²=0, and reorganizing the equation yields, 2x _(in) x _(tgt)+2y _(in) y _(tgt)+2z _(in) z _(tgt)−2ct _(in) t _(tgt)=(x _(tgt) ² +y _(tgt) ² +z _(tgt) ² −c ² t _(tgt) ²)+(x _(in) ² +y _(in) ² +z _(in) ² −c ² t _(in) ²)   (7)

letting: λ=x_(tgt) ²+y_(tgt) ²+z_(tgt) ²−c²t_(tgt) ² which is a Lorentz invariant, and organizing equation (7) for in=1, . . .M, above as a linear system, it becomes, 2.A. {right arrow over (v)}=λ.I _(—) v+{right arrow over (b)}  (8)

where, ${A = \begin{bmatrix} x_{1} & y_{1} & z_{1} & {- {ct}_{1}} \\ \vdots & \vdots & \vdots & \vdots \\ x_{i\quad n} & y_{i\quad n} & z_{i\quad n} & {- {ct}_{i\quad n}} \\ \vdots & \vdots & \vdots & \vdots \\ x_{M} & y_{M} & z_{M} & {- {ct}_{M}} \end{bmatrix}},{\overset{\rightarrow}{v} = \begin{bmatrix} x_{tgt} \\ y_{tgt} \\ z_{tgt} \\ {ct}_{tgt} \end{bmatrix}},{{I\_ v} = \begin{bmatrix} 1 \\ \vdots \\ 1 \\ \vdots \\ 1 \end{bmatrix}},{\overset{\rightarrow}{b} = \begin{bmatrix} {x_{1}^{2} + y_{1}^{2} + z_{1}^{2} - {c^{2}t_{1}^{2}}} \\ \vdots \\ {x_{i\quad n}^{2} + y_{i\quad n}^{2} + z_{i\quad n}^{2} - {c^{2}t_{i\quad n}^{2}}} \\ \vdots \\ {x_{M}^{2} + y_{M}^{2} + z_{M}^{2} - {c^{2}t_{M}^{2}}} \end{bmatrix}}$

and depending on the value of M, the matrix A may or may not be a square matrix. Assuming that M≧4, the method of least squares may be applied by multiplying the transpose of A (A^(T)) by both sides of equation (8) above, yielding: 2A ^(T) A {right arrow over (v)}=λA ^(T) I _(—) v+A ^(T) {right arrow over (b)}  (9)

solving for {right arrow over (v)}, {right arrow over (v)}=½(A ^(T) A)⁻¹ A ^(T) I _(—) v.λ+½(A ^(T) A)⁻¹ A ^(T) {right arrow over (b)} {right arrow over (v)}={right arrow over (d)}λ+{right arrow over (e)}  (10) where, {right arrow over (d)}=½(A ^(T) A)⁻¹ A ^(T) I _(—) v and {right arrow over (e)}=½(A ^(T) A)⁻¹ A ^(T) {right arrow over (b)}

Taking a Lorentz inner product of {right arrow over (v)} with itself gives, λ=<{right arrow over (v)},{right arrow over (v)}>_(L) λ=<{right arrow over (d)}.λ+{right arrow over (e)},{right arrow over (d)}.λ+{right arrow over (e)}> _(L)   (11)

λ=<{right arrow over (d)},{right arrow over (d)}>_(L)λ²+2<{right arrow over (d)},{right arrow over (e)}>_(L)λ+<{right arrow over (e)}, {right arrow over (e)}>_(L), this results in a quadratic equation with respect to λ, yielding <{right arrow over (d)},{right arrow over (d)}> _(L)λ²+2<{right arrow over (d)},{right arrow over (e)}> _(L)−1λ+<{right arrow over (e)},{right arrow over (e)}> _(L)=0   (12)

solving for λ yields, $\begin{matrix} {\lambda_{\pm} = \frac{\begin{matrix} {{- \left( {{2\left\langle {\overset{\rightarrow}{d},\overset{\rightarrow}{e}} \right\rangle_{L}} - 1} \right)} \pm} \\ \sqrt{\quad{\left( {{2\quad\left\langle {\overset{\rightarrow}{d},\overset{\rightarrow}{e}} \right\rangle_{L}} - 1} \right)^{2} - {4\quad\left\langle {\overset{\rightarrow}{d},\overset{\rightarrow}{d}} \right\rangle_{L}\quad\left\langle {\overset{\rightarrow}{e},\overset{\rightarrow}{e}} \right\rangle_{L}}}} \end{matrix}}{2\left\langle {\overset{\rightarrow}{d},\overset{\rightarrow}{d}} \right\rangle_{L}}} & (13) \end{matrix}$

From the quadratic equation above, λ can be calculated, and hence, {right arrow over (v)} can be obtained by $\begin{bmatrix} x_{{tgt} \pm} \\ y_{{tgt} \pm} \\ z_{{tgt}_{\pm}} \\ {ct}_{{tgt} \pm} \end{bmatrix} = {{\overset{\rightarrow}{v}}_{\pm} = {{\overset{\rightarrow}{d}.\lambda_{\pm}} + \overset{\rightarrow}{e}}}$

Because λ yields two values from the solution of equation (13), which are two possible positions of the object, therefore, in order to ascertain the correct position of the object, the following vectors may be computed: ${r\_ ch}_{\pm} = {\begin{bmatrix} {{{Ps}_{1} - P_{{tgt}_{\pm}}}} \\ \vdots \\ {{{\overset{\rightarrow}{P}s_{i\quad n}} - P_{{tgt} \pm}}} \\ \vdots \\ {{{\overset{\rightarrow}{P}s_{M}} - P_{{tgt} \pm}}} \end{bmatrix} - \begin{bmatrix} {sr}_{1} \\ \vdots \\ {sr}_{i\quad n} \\ \vdots \\ {sr}_{M} \end{bmatrix}}$

From the computation above, the vector with the smallest error norm of r_ch_(±) may be chosen to be the correct position of the object.

FIG. 4 is a contour plot of the standard deviation of the resulting error for three sensors used in determining the location of an object according to some embodiments of the invention. Likewise, FIG. 5 is a contour plot of the standard deviation of the resulting error for four sensors used in determining the location of an object according to some embodiments of the invention and FIG. 6 is a contour plot of the standard deviation of the resulting error for five sensors used in determining the location of an object according to some embodiments of the invention.

As can be seen from FIGS. 4-6, the error is relatively small inside the sensor configuration, and it becomes larger for objects positioned away from the center. In particular, FIG. 4 demonstrates that the error values are particularly large along the rays that are collinear to the line segments connecting sensor pairs. One reason for this large error may be that the discriminant in the quadratic expression of λ is zero or nearly zero, and that may contribute to large errors in the calculation. Another inference that can be surmised from FIGS. 4-6 is that adding more sensors dramatically improves the accuracy of the position determination.

Another exemplary embodiment of the invention is discussed with reference to FIG. 7. FIG. 7 is a schematic diagram of another embodiment of position location system 400 using a 3-dimensional coordinate system to implement a TOA computation. As shown, this embodiment may comprise positioning six sensors 405(a), 405(b), 405(c), 405(d), 405(e), and 405(f) in a 20×20 mile grid at the following position vector locations: ${{\overset{\rightarrow}{P}s_{1}} = \begin{bmatrix} 5 \\ 0 \\ 0 \end{bmatrix}},{{\overset{\rightarrow}{P}s_{2}} = \begin{bmatrix} 10 \\ 10 \\ 0.5 \end{bmatrix}},{{\overset{\rightarrow}{P}s_{3}} = \begin{bmatrix} {- 8} \\ 11 \\ 1 \end{bmatrix}},{{\overset{\rightarrow}{P}s_{4}} = \begin{bmatrix} {- 3} \\ {- 9} \\ 1.5 \end{bmatrix}},{{\overset{\rightarrow}{P}s_{5}} = \begin{bmatrix} 8 \\ {- 8} \\ 2 \end{bmatrix}},{{\overset{\rightarrow}{P}s_{6}} = {\begin{bmatrix} 11 \\ 2 \\ 2.5 \end{bmatrix}.\quad{As}}}$ discussed above, for calculation purposes, each grid node may be considered to be an object position. For each object position, an estimate of the position of the object for each sensor may be performed by using slant range values at each sensor 405(a), 405(b), 405(c), 405(d), 405(e), and 405(f). Then, a similar calculation as above is used to estimate object position based on the noise added range data.

FIGS. 8-13, are schematic representations of results of the calculation for each grid node presented in terms of a line segment connecting a true position of the object represented by a circle, and a simulated position of the object, represented by an ‘x’ symbol, so that the greater the segment length connecting the two points, the worse the error. In other words, where the circle and the x coincide (e.g., {circle around (×)})) there is relatively small error.

FIG. 8 is a schematic representation of the above described error plot for a three dimensional case using four sensors and viewed from the top. FIG. 9 is a schematic of the same three dimensional, four sensor plot as FIG. 8, except the view is from the side.

FIG. 10 is a schematic representation of the above described error plot for a three dimensional case using five sensors and viewed from the top. FIG. 11 is a schematic of the same three dimensional, five sensor plot as FIG. 10, except the view is from the side.

FIG. 12 is a schematic representation of the above described error plot for a three dimensional case using six sensors and viewed from the top. FIG. 13 is a schematic of the same three dimensional, six sensor plot as FIG. 12, except the view is from the side.

As demonstrated in FIGS. 8-13, the results of the position calculation for the above described TOA computation gives quite accurate results near the sensor positions. Away from the sensor positions, the results of the TOA computation are not as accurate. The trend in values of the mean squared error seems to indicate that adding more sensors may improve the accuracy, but not by too much because sensor positions along the z-axis may be limited by practical considerations.

Some embodiments of the invention may perform object position computation using a TDOA computation. Some methods of performing TDOA computations are known. For example, the above noted paper by Chan and Ho describes a TDOA calculation.

In contrast to the TOA computation, the TDOA computation uses the difference of the time of arrival at each sensor with respect to a reference sensor to compute the position of a object. Therefore, the set of equations to be solved is somewhat different. Also, the time of transmission or reflection may not be needed.

First, a description of a Taylor Series TDOA (TS-TDOA) method of computing object position is provided. Initially, the position of the object is such that x _(tgt) =x _(c) +Δx y _(tgt) =y _(c) +Δy z _(tgt) =z _(c) +Δz

Then, the slant range equation for each in can be expanded as a Taylor series about (x_(c), y_(c), z_(c)) so that ${{sr}_{i\quad n} = {\sqrt{\left( {x_{i\quad n} - x_{tgt}} \right)^{2} + \left( {y_{i\quad n} - y_{tgt}} \right)^{2} + \left( {z_{i\quad n} - z_{tgt}} \right)^{2}} = {\sqrt{\left( {x_{i\quad n} - \left( {x_{c} - {\Delta\quad x}} \right)} \right)^{2} + \left( {y_{i\quad n} - \left( {y_{c} - {\Delta\quad y}} \right)} \right)^{2} + \left( {z_{i\quad n} - \left( {z_{c} - {\Delta\quad z}} \right)} \right)^{2}} \approx {\sqrt{\left( {x_{i\quad n} - x_{c}} \right)^{2} + \left( {y_{i\quad n} - y_{c}} \right)^{2} + \left( {z_{i\quad n} - z_{c}} \right)^{2}} + \frac{{{- \left( {x_{i\quad n} - x_{c}} \right)}\Delta\quad x} - {\left( {y_{i\quad n} - y_{c}} \right)\Delta\quad y} - {\left( {z_{i\quad n} - z_{c}} \right)\Delta\quad z}}{\sqrt{\left( {x_{i\quad n} - x_{c}} \right)^{2} + \left( {y_{i\quad n} - y_{c}} \right)^{2} + \left( {z_{i\quad n} - z_{c}} \right)^{2}}} + \ldots}}}}\quad$

Letting sr_(c in)=√{square root over ((x_(in)−x_(c))²+(y_(in)−y_(c))²+(z_(in)−z_(c))²)} and ignoring higher order terms gives ${sr}_{i\quad n} \approx {{sr}_{c\quad i\quad n} - {\frac{\left( {x_{i\quad n} - x_{c}} \right)}{{sr}_{c\quad i\quad n}}\Delta\quad x} - {\frac{\left( {y_{i\quad n} - y_{c}} \right)}{{sr}_{c\quad i\quad n}}\Delta\quad y} - {\frac{\left( {z_{i\quad n} - z_{c}} \right)}{{sr}_{c\quad i\quad n}}\Delta\quad{z.}}}$

Now, the range difference equation with respect to sensor 1 may be defined for each in so that ${sr\_ n}_{{i\quad n},1} \equiv {{sr}_{i\quad n} - {sr}_{1}} \approx {{sr}_{c\quad i\quad n} - {\frac{\left( {x_{i\quad n} - x_{c}} \right)}{{sr}_{c\quad i\quad n}}\Delta\quad x} - {\frac{\left( {y_{i\quad n} - y_{c}} \right)}{{sr}_{c\quad i\quad n}}\Delta\quad y} - {\frac{\left( {z_{i\quad n} - z_{c}} \right)}{{sr}_{c\quad i\quad n}}\Delta\quad z} - {sr}_{c\quad 1} + {\frac{\left( {x_{1} - x_{c}} \right)}{{sr}_{c\quad 1}}\Delta\quad x} + {\frac{\left( {y_{1} - y_{c}} \right)}{{sr}_{c\quad 1}}\Delta\quad y} + {\frac{\left( {z_{1} - z_{c}} \right)}{{sr}_{c\quad 1}}\Delta\quad z}} \approx {{sr}_{c\quad i\quad n} - {sr}_{c\quad 1} + {\left( {\frac{\left( {x_{1} - x_{c}} \right)}{{sr}_{c\quad 1}} - \frac{\left( {x_{i\quad n} - x_{c}} \right)}{{sr}_{c\quad i\quad n}}} \right)\Delta\quad x} + {\left( {\frac{\left( {y_{1} - y_{c}} \right)}{{sr}_{c\quad 1}} - \frac{\left( {y_{i\quad n} - y_{c}} \right)}{{sr}_{c\quad i\quad n}}} \right)\Delta\quad y} + {\left( {\frac{\left( {z_{1} - z_{c}} \right)}{{sr}_{c\quad 1}} - \frac{\left( {z_{i\quad n} - z_{c}} \right)}{{sr}_{c\quad i\quad n}}} \right)\Delta\quad{z.}}}$

Reorganizing the equations in=2, . . . , M as a linear system gives G_(ts){right arrow over (v)}_(ts)={right arrow over (h)}_(ts)

where $G_{ts} = {\quad{\begin{bmatrix} {\frac{\left( {x_{1} - x_{c}} \right)}{{sr}_{c\quad 1}} - \frac{\left( {x_{2} - x_{c}} \right)}{{sr}_{c\quad 2}}} & {\frac{\left( {y_{1} - y_{c}} \right)}{{sr}_{c\quad 1}} - \frac{\left( {y_{2} - y_{c}} \right)}{{sr}_{c\quad 2}}} & {\frac{\left( {z_{1} - z_{c}} \right)}{{sr}_{c\quad 1}} - \frac{\left( {z_{2} - z_{c}} \right)}{{sr}_{c\quad 2}}} \\ \vdots & \vdots & \vdots \\ {\frac{\left( {x_{1} - x_{c}} \right)}{{sr}_{c\quad 1}} - \frac{\left( {x_{i\quad n} - x_{c}} \right)}{{sr}_{c\quad i\quad n}}} & {\frac{\left( {y_{1} - y_{c}} \right)}{{sr}_{c\quad 1}} - \frac{\left( {y_{i\quad n} - y_{c}} \right)}{{sr}_{c\quad i\quad n}}} & {\frac{\left( {z_{1} - z_{c}} \right)}{{sr}_{c\quad 1}} - \frac{\left( {z_{i\quad n} - z_{c}} \right)}{{sr}_{c\quad i\quad n}}} \\ \vdots & \vdots & \vdots \\ {\frac{\left( {x_{1} - x_{c}} \right)}{{sr}_{c\quad 1}} - \frac{\left( {x_{M} - x_{c}} \right)}{{sr}_{c\quad M}}} & {\frac{\left( {y_{1} - y_{c}} \right)}{{sr}_{c\quad 1}} - \frac{\left( {y_{M} - y_{c}} \right)}{{sr}_{c\quad M}}} & {\frac{\left( {z_{1} - z_{c}} \right)}{{sr}_{c\quad 1}} - \frac{\left( {z_{M} - z_{c}} \right)}{{sr}_{c\quad M}}} \end{bmatrix},{v_{ts} = \begin{bmatrix} {\Delta\quad x} \\ {\Delta\quad y} \\ {\Delta\quad z} \end{bmatrix}},{h_{ts} = {\begin{bmatrix} {{sr\_ n}_{2,1} - \left( {{sr}_{c\quad 2} - {sr}_{c\quad 1}} \right)} \\ \vdots \\ {{sr\_ n}_{{i\quad n},1} - \left( {{sr}_{c\quad{in}} - {sr}_{c\quad 1}} \right)} \\ \vdots \\ {{sr\_ n}_{M,1} - \left( {{sr}_{c\quad M} - {sr}_{c\quad 1}} \right)} \end{bmatrix}.}}}}$

With this linear system, an iterative approach may be used to compute the values of (x_(tgt), y_(tgt), z_(tgt)). One of example of an iterative approach is as follows.

The TS TDOA computation begins with range difference values sr_n_(in,1) already known, for in=2, . . . ,M. Then, an initial guess on the values of the object position (x_(c) ⁰, y_(c) ⁰, z_(c) ⁰) may be made with 0 as an index for initial guess of the iteration. Then, the slant range value sr_(c in) may be calculated for in=1, . . . ,M based on the guess of the object position. Once sr_(c in) is calculated, the linear system G_(ts){right arrow over (v)}_(ts)={right arrow over (h)}_(ts) can be solved as a least squares problem for an over-determined system so that {right arrow over (v)} _(ts)=(G _(ts) ^(T) Q ⁻¹ G _(ts))⁻¹ G _(ts) ^(T) Q ⁻¹ {right arrow over (h)} _(ts)

where Q is the covariance matrix of dimension (M−1)×(M−1) and is related to the random errors associated with the difference in range values, nominally set to 1 along the diagonal and 0.5 for the off-diagonal elements. Then, a new set of guess values can now be computed from {right arrow over (v)}_(ts)=[Δx Δy Δz]^(T) so that $\begin{bmatrix} x_{c}^{N + 1} \\ y_{c}^{N + 1} \\ z_{c}^{N + 1} \end{bmatrix} = {\begin{bmatrix} x_{c}^{N} \\ y_{c}^{N} \\ z_{c}^{N} \end{bmatrix} + \begin{bmatrix} {\Delta\quad x} \\ {\Delta\quad y} \\ {\Delta\quad z} \end{bmatrix}}$

where N is the iteration index. The steps may be repeated with the new guess of the object position by going back and calculating again. If the initial guess is reasonably accurate, the solution vector should converge to the position of the object (x_(tgt), y_(tgt), z_(tgt)).

One problem with a TS TDOA computation is that it is an iterative method. If the initial guess is poor, then the iteration may not converge to the correct solution. In particular, when computing the object position using a computer processor the initial guess has to be somewhat close to the correct object position to achieve convergence. This can be inconvenient. In addition, the TS TDOA uses the first order Taylor series approximation, and there may be cases where the approximation gives an incorrect solution as well. However, in some embodiments the TS TDOA computation may be implemented as a reference as discussed below.

Another TDOA computation that avoids some of the drawbacks of the TS TDOA and can be used to compute object position is based upon the work of Chan and Ho. Herein this computation is called the CH TDOA. First, a set of difference equations in slant range are defined with respect to sensor 1 so that for in=1, . . . ,M, sr _(—) n _(in,1) =sr _(in) −sr ₁. Or, sr _(in) =sr _(—) n _(in,1) +sr ₁.

Squaring both sides gives $\begin{matrix} {{sr}_{i\quad n}^{2} = \left( {{sr\_ n}_{{i\quad n},1} + {sr}_{1}} \right)^{2}} \\ {= {{sr\_ n}_{{i\quad n},1}^{2} + {2{sr\_ n}_{{i\quad n},1}{sr}_{1}} + {{sr}_{1}^{2}.}}} \end{matrix}$

On the other hand, $\begin{matrix} {{sr}_{i\quad n}^{2} = {\left( {x_{i\quad n} - x_{tgt}} \right)^{2} + \left( {y_{i\quad n} - y_{tgt}} \right)^{2} + \left( {z_{i\quad n} - z_{tgt}} \right)^{2}}} \\ {= {\left( {x_{i\quad n}^{2} + y_{i\quad n}^{2} + z_{i\quad n}^{2}} \right) + \left( {x_{tgt}^{2} + y_{tgt}^{2} + z_{tgt}^{2}} \right) - {2x_{i\quad n}x_{tgt}} - \quad{2y_{i\quad n}y_{tgt}} - {2z_{i\quad n}{z_{tgt}.}}}} \end{matrix}$

Equating the two gives: sr _(—) n _(in,1) ²+2sr _(—) n _(in,1) sr ₁ +sr ₁ ²=(x _(in) ² +y _(in) ² +z _(in) ²)+(x _(tgt) ² +y _(tgt) ² +z _(tgt) ²)−2x _(in) x _(tgt)−2y _(in) y _(tgt)−2z _(in) z _(tgt).

The terms x_(tgt) ², y_(tgt) ², and z_(tgt) ², make the expression nonlinear. Therefore, a subtraction is applied using the in=1 equation so that for in=2, . . . ,M, sr _(—) n _(in,1) ²+2sr _(—) n _(in,1) sr ₁ +sr ₁ ² −sr ₁ ²=(x _(in) ² +y _(in) ² +z _(in) ²)+(x _(tgt) ² +y _(tgt) ² +z _(tgt) ²)−2x _(in) x _(tgt)−2y _(in) y _(tgt)−2z _(in) z _(tgt)−((x ₁ ² +y ₁ ² +z ₁ ²)+(x _(tgt) ² +y _(tgt) ² +z _(tgt) ²)−2x ₁ x _(tgt)−2y ₁ y _(tgt)−2z ₁ z _(tgt)) sr _(—) n _(in,1) ²+2sr _(—) n _(in,1) sr ₁=−2(x _(in) −x ₁)x _(tgt)−2(y _(in) −y ₁)y _(tgt)−2(z _(in) −z ₁)z _(tgt)+(x _(in) ² +y _(in) ² +z _(in) ²)−(x ₁ ² +y ₁ ² +z ₁ ²)

These equations, for in=2, . . . ,M, can be recast as a linear system so that G_(a){right arrow over (v)}={right arrow over (h)}

where ${G_{a} = \begin{bmatrix} {2\left( {x_{2} - x_{1}} \right)} & {2\left( {y_{2} - y_{1}} \right)} & {2\left( {z_{2} - z_{1}} \right)} & {2{sr\_ n}_{2,1}} \\ \vdots & \vdots & \vdots & \vdots \\ {2\left( {x_{i\quad n} - x_{1}} \right)} & {2\left( {y_{i\quad n} - y_{1}} \right)} & {2\left( {z_{i\quad n} - z_{1}} \right)} & {2{sr\_ n}_{{i\quad n},1}} \\ \vdots & \vdots & \vdots & \vdots \\ {2\left( {x_{M} - x_{1}} \right)} & {2\left( {y_{M} - y_{1}} \right)} & {2\left( {z_{M} - z_{1}} \right)} & {2{sr\_ n}_{M,1}} \end{bmatrix}},{\overset{\rightarrow}{v} = \begin{bmatrix} x_{tgt} \\ y_{tgt} \\ z_{tgt} \\ {r\quad d_{1}} \end{bmatrix}},{\overset{\rightarrow}{h} = {\begin{bmatrix} {{sr\_ n}_{2,1}^{2} - \left( {x_{2}^{2} + y_{2}^{2} + z_{2}^{2}} \right) + \left( {x_{1}^{2} + y_{1}^{2} + z_{1}^{2}} \right)} \\ \vdots \\ {{sr\_ n}_{{i\quad n},1}^{2} - \left( {x_{i\quad n}^{2} + y_{i\quad n}^{2} + z_{i\quad n}^{2}} \right) + \left( {x_{1}^{2} + y_{1}^{2} + z_{1}^{2}} \right)} \\ \vdots \\ {{sr\_ n}_{M,1}^{2} - \left( {x_{M}^{2} + y_{M}^{2} + z_{M}^{2}} \right) + \left( {x_{1}^{2} + y_{1}^{2} + z_{1}^{2}} \right)} \end{bmatrix}.}}$

Assuming that M>3, the linear system can be solved as a least squares problem.

First, the error vector is defined as ψ=G_(a){right arrow over (v)}−{right arrow over (h)}. Since Gaussian errors are involved, the least squares method is applied to minimize LS=({right arrow over (h)}−G _(a) {right arrow over (v)})^(T)(ψψ^(T))⁻¹({right arrow over (h)}−G _(a) {right arrow over (v)}). which is solved by {right arrow over (v)}=(G _(a) ^(T)Ψ⁻¹ G _(a))⁻¹ G _(a) ^(T)Ψ⁻¹ {right arrow over (h)}

where $\begin{matrix} {{\Psi = {{Exp}\left( {\psi\psi}^{T} \right)}},} \\ {= {{Expectation}{\quad\quad}{value}{\quad\quad}{of}\quad{{\psi\psi}^{T}.}}} \end{matrix}$

The covariance matrix Ψ is approximated by Ψ=c²BQB

where ${Q = \begin{bmatrix} 1 & 0.5 & \cdots & \cdots & 0.5 \\ 0.5 & 1 & 0.5 & \cdots & \vdots \\ \vdots & 0.5 & 1 & ⋰ & \vdots \\ \vdots & \cdots & ⋰ & ⋰ & 0.5 \\ 0.5 & \cdots & \cdots & 0.5 & 1 \end{bmatrix}},{B = {{{diag}\left( {{{sr\_}0_{2}},{{sr\_}0_{3}},\ldots\quad,{{sr\_}0_{M}}} \right)}.}}$

The matrix Q is the (M−1)×(M−1) covariance matrix of time-difference-of-arrival, and it is assumed that there is some correlation between the time-difference samples as reflected by the nonzero off-diagonal elements. The matrix B is a diagonal matrix with elements (sr_(—)0₂, sr_(—)0₃, . . . , sr_(—)0_(M)). Since B is not known prior to the computation, it is approximated by solving {right arrow over (v)} ₀=(Q _(a) ^(T) Q ⁻¹ G _(a))⁻¹ G _(a) ^(T) Q ⁻¹ {right arrow over (h)},

and determining from {right arrow over (v)}₀ the approximate slant range values (sr_(—)0₂,sr_(—)0₃, . . . , sr_(—)0_(M)).

Once Ψ is computed from the approximate value of B and Q, {right arrow over (v)}₁ is computed from {right arrow over (v)} ₁=(G _(a) ^(T)Ψ⁻¹ G _(a))⁻¹ G _(a) ^(T)Ψ⁻¹ {right arrow over (h)} where {right arrow over (v)}₁=[{tilde over (x)}_(tgt) {tilde over (y)}_(tgt) {tilde over (z)}_(tgt) {tilde over (s)}r₁]^(T).

Now, the computed solution {right arrow over (v)}₁ is refined by imposing the condition that sr ₁ ⁻² =e ₁ +e ₂ +e ₃. where e ₁=(x ₁ −x _(tgt))², e ₂=(y ₁ −y _(tgt))², e ₃=(z ₁ −z _(tgt))². This gives a new over-determined system to solve: e ₁=(x ₁ −{tilde over (x)} _(tgt))², e ₂=(y ₁ −{tilde over (y)} _(tgt))², e ₃=(z ₁ −{tilde over (z)} _(tgt))², e ₁ +e ₂ +e ₃ =sr ₁ ⁻². As a linear system, {tilde over (G)}_(a){tilde over (v)}={tilde over (h)}

where ${{\overset{\sim}{G}}_{a} = \begin{bmatrix} 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 \\ 1 & 1 & 1 & 1 \end{bmatrix}},{\overset{\sim}{v} = \begin{bmatrix} e_{1} \\ e_{2} \\ e_{3} \end{bmatrix}},{\overset{\rightarrow}{h} = {\begin{bmatrix} \left( {x_{1} - {\overset{\sim}{x}}_{tgt}} \right)^{2} \\ \left( {y_{1} - {\overset{\sim}{y}}_{tgt}} \right)^{2} \\ \left( {z_{1} - {\overset{\sim}{z}}_{tgt}} \right)^{2} \\ {\overset{\sim}{r\quad d}}_{1}^{2} \end{bmatrix}.}}$

As a least squares problem, the function to be minimized is LS=({tilde over (h)}−{tilde over (G)} _(a) {tilde over (v)})^(T){tilde over (Ψ)}⁻¹({tilde over (h)}−{tilde over (G)} _(a) {tilde over (v)})

where the covariance matrix {tilde over (Ψ)} is approximated by {tilde over (Ψ)}={tilde over (B)}G _(a) ⁻¹ QG _(a) ^(T) ⁻¹ {tilde over (B)} with {tilde over (B)}=diag({tilde over (x)} _(tgt) −x ₁ ,{tilde over (y)} _(tgt) −y ₁ ,{tilde over (z)} _(tgt) −z ₁ ,{tilde over (s)}r ₁).

Thus, $\begin{matrix} {\overset{\sim}{v} = {{\left( {{\overset{\sim}{G}}_{a}^{T}{\overset{\sim}{\Psi}}^{- 1}{\overset{\sim}{G}}_{a}} \right)^{- 1} \cdot \left( {{\overset{\sim}{G}}_{a}^{T}{\overset{\sim}{\Psi}}^{- 1}} \right)}\overset{\sim}{h}}} \\ {= {{\left( {{{\overset{\sim}{G}}_{a}^{T}\left( {{\overset{\sim}{B}}^{- 1}G_{a}^{T}Q^{- 1}G_{a}{\overset{\sim}{B}}^{- 1}} \right)}{\overset{\sim}{G}}_{a}} \right)^{- 1} \cdot \left( {{\overset{\sim}{G}}_{a}^{T}\left( {{\overset{\sim}{B}}^{- 1}G_{a}^{T}Q^{- 1}G_{a}{\overset{\sim}{B}}^{- 1}} \right)} \right)}{\overset{\sim}{h}.}}} \end{matrix}$

Once {tilde over (v)} is calculated, the refined solution is computed by $\begin{bmatrix} x_{tgt} \\ y_{tgt} \\ z_{tgt} \end{bmatrix} = {\begin{bmatrix} {x_{1} \pm \sqrt{e_{1}}} \\ {y_{1} \pm \sqrt{e_{2}}} \\ {z_{1} \pm \sqrt{e_{3}}} \end{bmatrix}.}$

Because of the square root involved, there are up to eight possible solutions. In some embodiments, the solution is selected by choosing the solution closest to the approximate solution ({tilde over (x)}_(tgt), {tilde over (y)}_(tgt), {tilde over (z)}_(tgt)) that was determined above.

In a two dimensional (2-D) case with three sensors, the position of the object can be found without resorting to least squares method. In this case, the difference equations can be written ${\begin{bmatrix} {x_{2} - x_{1}} & {y_{2} - y_{1}} \\ {x_{3} - x_{1}} & {y_{3} - y_{1}} \end{bmatrix}\begin{bmatrix} x_{tgt} \\ y_{tgt} \end{bmatrix}} = {{\left( {{\begin{bmatrix} {sr\_ n}_{2,1}^{2} \\ {sr\_ n}_{3,1}^{2} \end{bmatrix}{sr}_{1}} + {\frac{1}{2}\begin{bmatrix} {{sr\_ n}_{2,1}^{2} - \left( {x_{2}^{2} + y_{2}^{2}} \right) + \left( {x_{1}^{2} + y_{1}^{2}} \right)} \\ {{sr\_ n}_{3,1}^{2} - \left( {x_{3}^{2} + y_{3}^{2}} \right) + \left( {x_{1}^{2} + y_{1}^{2}} \right)} \end{bmatrix}}} \right)\quad\begin{bmatrix} x_{tgt} \\ y_{tgt} \end{bmatrix}} = {\begin{bmatrix} {{a_{1} \cdot {sr}_{1}} + b_{1}} \\ {{a_{2} \cdot {sr}_{1}} + b_{2}} \end{bmatrix}.}}$

and substituted into sr ₁ ²=(x _(tgt) −x ₁)²+(y _(tgt) −y ₁)²

to give α·sr ₁ ² +β·sr ₁+γ=0 where β=(a ₁ ² +a ₂ ²−1) β=a ₁(b ₁ −x ₁)+a ₂(b ₂ −y ₁), γ=(b ₁ −x ₁)²+(b ₂ −y ₁)².

Solving for sr₁ gives ${{sr}_{1 \pm} = {{\frac{{- \beta} \pm \sqrt{\beta^{2} - {4\quad{\alpha\gamma}}}}{2\alpha}.{From}}\quad{sr}_{1}}},{\begin{bmatrix} x_{{tgt} \pm} \\ y_{{tgt} \pm} \end{bmatrix} = {\begin{bmatrix} {{a_{1} \cdot {sr}_{1 \pm}} + b_{1}} \\ {{a_{2} \cdot {sr}_{1 \pm}} + b_{2}} \end{bmatrix}.}}$

From the two possible solutions, the correct solution can be determined by calculating the resulting range values and comparing them with the actual data.

In a three dimensional (3-D) case with four sensors, the position of the object can be found without resorting to least squares method. In this case, the difference equations can be written ${{\begin{bmatrix} {x_{2} - x_{1}} & {y_{2} - y_{1}} & {z_{2} - z_{1}} \\ {x_{3} - x_{1}} & {y_{3} - y_{1}} & {z_{3} - z_{1}} \\ {x_{4} - x_{1}} & {y_{4} - y_{1}} & {z_{4} - z_{1}} \end{bmatrix}\begin{bmatrix} x_{tgt} \\ y_{tgt} \\ z_{tgt} \end{bmatrix}} = \left( {{\begin{bmatrix} {sr\_ n}_{2,1}^{2} \\ {sr\_ n}_{3,1}^{2} \\ {sr\_ n}_{4,1}^{2} \end{bmatrix}{sr}_{1}} + {\frac{1}{2}\begin{bmatrix} {{sr\_ n}_{2,1}^{2} - \left( {x_{2}^{2} + y_{2}^{2} + z_{2}^{2}} \right) + \left( {x_{1}^{2} + y_{1}^{2} + z_{2}^{2}} \right)} \\ {{sr\_ n}_{3,1}^{2} - \left( {x_{3}^{2} + y_{3}^{2} + z_{3}^{2}} \right) + \left( {x_{1}^{2} + y_{1}^{2} + z_{1}^{2}} \right)} \\ {{sr\_ n}_{4,1}^{2} - \left( {x_{4}^{2} + y_{4}^{2} + z_{4}^{2}} \right) + \left( {x_{1}^{2} + y_{1}^{2} + z_{1}^{2}} \right)} \end{bmatrix}}} \right)},\quad{\begin{bmatrix} x_{tgt} \\ y_{tgt} \\ z_{tgt} \end{bmatrix} = {\begin{bmatrix} {{a_{1} \cdot {sr}_{1}} + b_{1}} \\ {{a_{2} \cdot {sr}_{1}} + b_{2}} \\ {{a_{3} \cdot {sr}_{1}} + b_{3}} \end{bmatrix}.}}$

and substituted into sr ₁ ²=(x _(tgt) −x ₁)²+(y _(tgt) −y ₁)²+(z _(tgt) −z ₁)²

to give α·sr ₁ ² +βsr ₁+γ=0 where α=(a ₁ ² +a ₂ ² +a ₃ ²−1), β=a ₁(b ₁ −x ₁)+a ₂(b ₂ −y ₁)+a ₃(b ₃ −z ₁), γ=(b ₁ −x ₁)²+(b ₂ −y ₁)²+(b ₃ −z ₁)².

Solving for sr₁ gives ${{sr}_{1 \pm} = {{\frac{{- \beta} \pm \sqrt{\beta^{2} - {4\quad\alpha\quad\gamma}}}{2\quad\alpha}.{From}}\quad{sr}_{1}}},{\begin{bmatrix} x_{{tgt} \pm} \\ y_{{tgt} \pm} \\ z_{{tgt} \pm} \end{bmatrix} = {\begin{bmatrix} {{a_{1} \cdot {sr}_{1 \pm}} + b_{1}} \\ {{a_{2} \cdot {sr}_{1 \pm}} + b_{2}} \\ {{a_{3} \cdot {sr}_{1 \pm}} + b_{3}} \end{bmatrix}.}}$

From the two possible solutions, the correct solution can be determined by calculating the resulting range values and comparing with the actual data.

The CH TDOA may be performed for a nominal 2-D case in the same manner as the TOA computation described above. The sensors are positioned at the same locations as in the 2-D case for the TOA computation.

For this computation, a grid covering a 20 mile×20 mile region and encompassing the sensors is used so that each grid node may be considered to be a object position. Then, for each object position, the CH TDOA method described above may be used to estimate object position based on the noise added range data. A Monte-Carlo or other numeric approximation approach may be employed to compute the standard deviation of the error between the true position of the object and the estimated position of the object. The standard deviation of Gaussian error added to the range may be σ_(r)=2.24×10⁻³.

In FIGS. 14(a), 14(b) and 14(c), contour plots of the standard deviation of the resulting errors are shown. As shown in the Figures, the error is small inside the sensor configuration, and it becomes larger for objects positioned away from the center. In particular, as shown in FIG. 14(a), it is the error values are relatively large along the rays that are collinear to the line segments connecting sensor pairs, similar to the results in the TOA computation case for 2-D. It turns out that along these rays, the discriminant in the quadratic expression of sr_(1±) above is zero or nearly zero, and that may contribute to large errors in the CH TDOA calculation.

FIG. 14(b) shows the results for four sensors, there are certain regions inside the sensor configuration where the error increases dramatically. This result differs greatly from the results of the same sensor configuration with the TOA computation. Examining the matrix G_(a) shows that, if a object is in those regions, either the difference of the range values or the difference of the components of the sensor positions are zero or nearly zero. This renders the matrix G_(a) nearly singular and results in poor estimation of the object position. On the other hand, and as shown in FIG. 14(c), adding an additional sensor removes these blind spots, and the results appear to be better than that of the results obtained using the TOA computation.

In a manner similar to the TOA computation, the CH TDOA computation can be applied to a nominal 3-D case. In the following, the numbers are dimensionless for convenience, but in practice can correspond to any suitable scale (e.g., miles, kilometers, etc.). The sensors are positioned at the same locations as those used in the 3-D case for the TOA computation.

As before, a grid covering a 20×20×10 dimensionless region and encompassing the sensors is used so that each grid node is considered to be a object position. Then, for each object position or grid node, the CH TDOA computation may be used to estimate object position based on the noise added range data. The standard deviation of Gaussian error added to the range is σ_(r)=2.24×10⁻³.

FIGS. 15-20 are schematic representations of results of the calculation for each grid node presented in terms of a line segment connecting a true position of the object represented by a circle, and a simulated position of the object, represented by an ‘x’ symbol, so that the greater the segment length connecting the two points, the worse the error. In other words, where the circle and the x coincide (e.g., {circle around (×)}) there is relatively small error.

FIG. 15 is a schematic representation of the above described error plot for a three dimensional case using four sensors and viewed from the top. FIG. 16 is a schematic of the same three dimensional, four sensor plot as FIG. 15, except the view is from the side.

FIG. 17 is a schematic representation of the above described error plot for a three dimensional case using five sensors and viewed from the top. FIG. 18 is a schematic of the same three dimensional, five sensor plot as FIG. 17, except the view is from the side.

FIG. 19 is a schematic representation of the above described error plot for a three dimensional case using six sensors and viewed from the top. FIG. 20 is a schematic of the same three dimensional, six sensor plot as FIG. 19, except the view is from the side.

In FIGS. 15-20 it is shown that near the sensors, the CH TDOA computation gives quite accurate results. Away from the sensors the computation is not as accurate.

The plots in FIG. 17 and 18 indicate that there are certain localized regions where the G_(a) matrix is once again nearly singular and causing poor results. Adding one more sensors may dramatically improve the results as shown in FIGS. 19 and 20.

As with the TOA computation, the trend in the values of mean squared error for CH TDOA seems to indicate that adding more sensors may improve the accuracy, but not too much since the sensor positioning along the z-axis is limited.

Comparing the CH TDOA six sensor case in FIGS. 19 and 20 and the TOA six sensor case in FIGS. 12-13 shows that CH TDOA computation is more accurate than the TOA computation especially when multiple sensors are used.

Thus, for some embodiments of the invention, the CH TDOA computation works better in terms of accuracy when the number of sensors used is five or more for 2-D and six or more for 3-D. When the number of sensors is one or two more than the spatial dimension, there may be certain regions or blind spots where the CH TDOA computation fails because the associated matrix G_(a) becomes nearly singular. In such cases, TOA computation appears to work better.

Referring again to FIG. 2, another embodiment of the invention is described wherein an addition method of computing object position is implemented. As shown in FIG. 2, there are M sensors with differing heights positioned at various locations of the x-y plane. A transmitted, or reflected signal from the object is received by the sensors so that the TOA of the signal from the object to each sensor is known. Assuming that the time of transmission, or reflection, from the object is also known, the slant range from the object to each sensor can be calculated: sr _(—)0_(in) =c(t _(—)0_(in) −t _(tgt))

for in=1, . . . , M where

sr_(—)0_(in)=Slant range between sensor in and object,

t_(—)0_(in)=Time of arrival,

t_(tgt)=Time of transmission or reflection,

c=Speed of light.

It is likely that the actual times of arrival have errors in them; so, a Gaussian noise is added to the time of arrival so that ${t_{i\quad n} = {{{t\_}0_{i\quad n}} + {N\left( \sigma_{t} \right)}}},\begin{matrix} {{sr}_{i\quad n} = {c\left( {t_{i\quad n} - t_{tgt}} \right)}} \\ {= {c\left( {{{t\_}0_{i\quad n}} + {N\left( \sigma_{t} \right)} - t_{tgt}} \right)}} \\ {= {{c\left( {{{t\_}0_{i\quad n}} - t_{tgt}} \right)} + {{cN}\left( \sigma_{t} \right)}}} \end{matrix}$ sr_(i  n) = sr_0_(n) + N(σ_(r)),

where σ_(r)=cσ_(t).

The term N(σ) denotes a Gaussian random number with variance of σ².

So, the TDOA computation is to be used to calculate the position vector {right arrow over (P)}_(tgt)=[x_(tgt) y_(tgt) z_(tgt)]^(T) of the object based on the following data set: t_(i  n) = Time    of  arrival ${{sr}_{i\quad n} = {{Slant}\quad{range}{\quad\quad}{from}{\quad\quad}{target}\quad{to}{\quad\quad}{sensor}}},{{\overset{\rightarrow}{P}s_{i\quad n}} = {\begin{bmatrix} x_{i\quad n} \\ y_{i\quad n} \\ z_{i\quad n} \end{bmatrix} = {{Position}{\quad\quad}{of}{\quad\quad}{each}\quad{sensor}}}},$

for in=1, . . . ,M.

We introduce the following notations for convenience. First, a pair of nominal vectors is defined as ${\overset{\rightarrow}{x} = \begin{bmatrix} x_{1} \\ x_{2} \\ x_{3} \end{bmatrix}},{\overset{\rightarrow}{y} = {\begin{bmatrix} y_{1} \\ y_{2} \\ y_{3} \end{bmatrix}.}}$

Then, an inner product is defined as <{right arrow over (x)},{right arrow over (y)}>=x ₁ y ₁ +x ₂ y ₂ +x ₃ y ₃.

The norm of a vector is then defined as $\left. ||\overset{\rightharpoonup}{x} \right.|| = {\sqrt{\left\langle {\overset{\rightharpoonup}{x},\overset{\rightharpoonup}{y}} \right\rangle}.}$

Using the above notations, for in=2, . . . ,M: $\begin{matrix} {{c\left( {t_{i\quad n} - t_{1}} \right)} = {c\left( {t_{i\quad n} - t_{tgt} + t_{tgt} - t_{1}} \right)}} \\ {= {{c\left( {t_{i\quad n} - t_{tgt}} \right)} - {c\left( {t_{1} - t_{tgt}} \right)}}} \\ {= {{sr}_{i\quad n} - {{sr}_{1}.}}} \end{matrix}$

On the other hand, sr _(in) =∥{right arrow over (P)}s _(in) −{right arrow over (P)} _(tgt)∥.

Combining the two expressions gives c(t _(in) −t ₁)=∥{right arrow over (P)}s _(in) −{right arrow over (P)} _(tgt) ∥−∥{right arrow over (P)}s ₁ −{right arrow over (P)} _(tft)∥.

Multiplying both sides by ∥{right arrow over (P)}s_(in)−{right arrow over (P)}_(tgt)∥+∥{right arrow over (P)}s₁−{right arrow over (P)}_(tgt) ∥ to remove the square roots gives ${{c\left( {t_{i\quad n} - t_{1}} \right)}\left( {{{{\overset{\rightarrow}{P}s_{i\quad n}} - {\overset{\rightarrow}{P}}_{tgt}}} + {{{\overset{\rightarrow}{P}s_{1}} - {\overset{\rightarrow}{P}}_{tgt}}}} \right)} = {{\left( {{{{\overset{\rightarrow}{P}s_{i\quad n}} - {\overset{\rightarrow}{P}}_{tgt}}} - {{{\overset{\rightarrow}{P}s_{1}} - {\overset{\rightarrow}{P}}_{tgt}}}} \right)\left( {{{{\overset{\rightarrow}{P}s_{i\quad n}} - {\overset{\rightarrow}{P}}_{tgt}}} + {{{\overset{\rightarrow}{P}s_{1}} - {\overset{\rightarrow}{P}}_{tgt}}}} \right)} = {{{{{\overset{\rightarrow}{P}s_{i\quad n}} - {\overset{\rightarrow}{P}}_{tgt}}}^{2} + {{{{\overset{\rightarrow}{P}s_{1}} - {\overset{\rightarrow}{P}}_{tgt}}} \cdot {{{\overset{\rightarrow}{P}s_{1}} - {\overset{\rightarrow}{P}}_{tgt}}}} - {{{{\overset{\rightarrow}{P}s_{1}} - {\overset{\rightarrow}{P}}_{tgt}}} \cdot {{{\overset{\rightarrow}{P}s_{i\quad n}} - {\overset{\rightarrow}{P}}_{tgt}}}} - {{{\overset{\rightarrow}{P}s_{1}} - {\overset{\rightarrow}{P}}_{tgt}}}^{2}} = {{{{{\overset{\rightarrow}{P}s_{i\quad n}} - {\overset{\rightarrow}{P}}_{tgt}}}^{2} + {{{\overset{\rightarrow}{P}s_{1}} - {\overset{\rightarrow}{P}}_{tgt}}}^{2}} = {{\left\langle {{{\overset{\rightarrow}{P}s_{i\quad n}} - {\overset{\rightarrow}{P}}_{tgt}},{{\overset{\rightarrow}{P}s_{i\quad n}} - {\overset{\rightarrow}{P}}_{tgt}}} \right\rangle - \left\langle {{{\overset{\rightarrow}{P}s_{1}} - {\overset{\rightarrow}{P}}_{tgt}},{{\overset{\rightarrow}{P}s_{1}} - {\overset{\rightarrow}{P}}_{tgt}}} \right\rangle} = {{\left\langle {{\overset{\rightarrow}{P}s_{i\quad n}},{Ps}_{i\quad n}} \right\rangle - {2\left\langle {{\overset{\rightarrow}{P}s_{i\quad n}},{\overset{\rightarrow}{P}s_{tgt}}} \right\rangle} + \left\langle {{\overset{\rightarrow}{P}s_{tgt}},{\overset{\rightarrow}{P}s_{tgt}}} \right\rangle - \left\langle {{\overset{\rightarrow}{P}s_{1}},{\overset{\rightarrow}{P}s_{1}}} \right\rangle + {2\left\langle {{\overset{\rightarrow}{P}s_{1}},{\overset{\rightarrow}{P}s_{tgt}}} \right\rangle} - \left\langle {{\overset{\rightarrow}{P}s_{tgt}},{\overset{\rightarrow}{P}s_{tgt}}} \right\rangle} = {{{\overset{\rightarrow}{P}s_{i\quad n}}}^{2} - {{\overset{\rightarrow}{P}s_{1}}}^{2} + {\left\langle {{{2\overset{\rightarrow}{P}s_{1}} - {2\overset{\rightarrow}{P}s_{i\quad n}}},{\overset{\rightarrow}{P}s_{tgt}}} \right\rangle.}}}}}}}$

On the other hand, ${{c\left( {t_{i\quad n} - t_{1}} \right)}\left( {{{{\overset{\rightarrow}{P}s_{i\quad n}} - {\overset{\rightarrow}{P}}_{tgt}}} + {{{\overset{\rightarrow}{P}s_{1}} - {\overset{\rightarrow}{P}}_{tgt}}}} \right)} = {{{c\left( {t_{i\quad n} - t_{1}} \right)}\left( {{c\left( {t_{i\quad n} - t_{tgt}} \right)} + {c\left( {t_{1} - t_{tgt}} \right)}} \right)} = {{{c^{2}\left( {t_{i\quad n} - t_{1}} \right)}\left( {t_{i\quad n} + t_{1} - {2t_{tgt}}} \right)} = {{{c^{2}\left( {t_{i\quad n} - t_{1}} \right)}\left( {t_{i\quad n} + t_{1}} \right)} - {2{c^{2}\left( {t_{i\quad n} - t_{1}} \right)}{t_{tgt}.}}}}}$

Combining the two gives: ∥{right arrow over (P)}s _(in)∥² −∥{right arrow over (P)}s ₁∥²+<2{right arrow over (P)}s ₁−2{right arrow over (P)}s _(in) , {right arrow over (P)}s _(tgt) >=c ²(t _(in) −t ₁)(t _(in) +t ₁)−2c ²(t _(in) −t ₁)t _(tgt).

Rearranging it gives: <2{right arrow over (P)}s ₁−2{right arrow over (P)}s _(in) , {right arrow over (P)}s _(tgt)>+2c ²(t _(in) −t ₁)t _(tgt) =∥{right arrow over (P)}s ₁∥² −∥{right arrow over (P)}s _(in)∥² +c ²(t _(in) −t ₁)(t _(in) −t ₁).   Equation 1:

Now, let the unknown be a vector: $\overset{\rightarrow}{v} = {\begin{bmatrix} x_{tgt} \\ y_{tgt} \\ z_{tgt} \\ t_{tgt} \end{bmatrix}.}$

Then, Equation 1 can be set up as a linear system for in=2, . . . ,M so that $\begin{bmatrix} {{2x_{1}} - {2x_{2}}} & {{2y_{1}} - {2y_{2}}} & {{2z_{1}} - {2z_{2}}} & {2{c\left( {t_{2} - t_{1}} \right)}} \\ \vdots & \vdots & \vdots & \vdots \\ {{2x_{1}} - {2x_{i\quad n}}} & {{2y_{1}} - {2y_{i\quad n}}} & {{2z_{1}} - {2z_{i\quad n}}} & {2{c\left( {t_{i\quad n} - t_{1}} \right)}} \\ \vdots & \vdots & \vdots & \vdots \\ {{2x_{1}} - {2x_{M}}} & {{2y_{1}} - {2y_{M}}} & {{2z_{1}} - {2z_{M}}} & {2{c\left( {t_{M} - t_{1}} \right)}} \end{bmatrix}{\quad{\begin{bmatrix} x_{tgt} \\ y_{tgt} \\ z_{tgt} \\ t_{tgt} \end{bmatrix} = {\begin{bmatrix} {{{\overset{\rightarrow}{P}s_{1}}}^{2} - {{\overset{\rightarrow}{P}s_{2}}}^{2} + {{c^{2}\left( {t_{2} - t_{1}} \right)}\left( {t_{2} + t_{1}} \right)}} \\ \vdots \\ {{{\overset{\rightarrow}{P}s_{1}}}^{2} - {{\overset{\rightarrow}{P}s_{i\quad n}}}^{2} + {{c^{2}\left( {t_{i\quad n} - t_{1}} \right)}\left( {t_{i\quad n} + t_{1}} \right)}} \\ \vdots \\ {{{\overset{\rightarrow}{P}s_{1}}}^{2} - {{\overset{\rightarrow}{P}s_{M}}}^{2} + {{c^{2}\left( {t_{M} - t_{1}} \right)}\left( {t_{M} + t_{1}} \right)}} \end{bmatrix}.}}}$

or G·{right arrow over (v)}={right arrow over (h)}.

In yet another embodiment of the invention, there is provided a method for computing object position using relative time of arrival (RTOA) signals. With reference to FIG. 2, there may be Ns sensors with differing heights positioned at various locations of the x-y plane. In addition, there may be an additional radar source. For example, a secondary surveillance radar (SSR) may be incorporated as described below.

In FIG. 21, a time history of a signal from the SSR to each of the receiver sensors is shown. The interrogator signal from the SSR radar is transmitted at t₀ and is reflected by an object at t_(tgt). The reflected signal is then is received by the sensors so that the time of arrival of the signal from the object to each sensor is known.

The slant range from the object to each sensor can be calculated as: sr _(in) =c(t _(in) −t _(tgt))

for in=1, . . . , Ns where

sr_(in)=Slant range between sensor in and object,

t_(in)=Time of arrival,

t_(tgt)=Time of reflection,

c=Speed of light.

The slant range from the object to the SSR is calculated as: sr ₀ =c(t _(tgt) −t ₀).

If the position of the object is represented as {right arrow over (P)}_(tgt)=[x_(tgt) y_(tgt) z_(tgt)]^(T), the slant range between the sensor in and the object is sr _(in) =∥{right arrow over (P)}s _(in) −{right arrow over (P)} _(tgt)∥.

So, the proposed RTOA computation is used to calculate the position vector {right arrow over (P)}_(tgt)=[x_(tgt) y_(tgt) z_(tgt) of the object based on the following data set: ${t_{0} = {{Time}{\quad\quad}{of}{\quad\quad}{transmission}{\quad\quad}{from}\quad{SSR}}},{t_{i\quad n} = {{Time}{\quad\quad}{of}{\quad\quad}{arrival}}},{{\overset{\rightarrow}{P}s_{i\quad n}} = {\begin{bmatrix} x_{i\quad n} \\ y_{i\quad n} \\ z_{i\quad n} \end{bmatrix} = {{Position}{\quad\quad}{of}{\quad\quad}{each}{\quad\quad}{sensor}}}},{{Ps}_{SSR} = {\begin{bmatrix} x_{SSR} \\ y_{SSR} \\ z_{SSR} \end{bmatrix} = {{Position}\quad{of}{\quad\quad}{SSR}}}},$

for in=1, . . . Ns.

Using the above notations, for in=1, . . . ,Ns: $\begin{matrix} {{c\left( {t_{in} - t_{0}} \right)} = {c\left( {t_{in} - t_{tgt} + t_{tgt} - t_{0}} \right)}} \\ {= {{c\left( {t_{in} - t_{tgt}} \right)} + {c\left( {t_{tgt} - t_{0}} \right)}}} \\ {= {{sr}_{in} + {{sr}_{0}.}}} \end{matrix}$

On the other hand, it is known that sr _(in) =∥{right arrow over (P)}s _(in) −{right arrow over (P)} _(tgt)∥ and sr ₀ =∥{right arrow over (P)}s _(SSR) −{right arrow over (P)} _(tgt)∥.

Combining the two expressions gives c(t _(in) −t ₀)=∥{right arrow over (P)}s_(in) −{right arrow over (P)} _(tgt) ∥+∥{right arrow over (P)}s _(SSR) −{right arrow over (P)} _(tgt)∥, or ∥{right arrow over (P)}s _(in) −{right arrow over (P)} _(tgt) ∥=c(t _(in) −t ₀)−∥{right arrow over (P)}s _(SSR) {right arrow over (P)} _(tgt)∥.

Squaring both sides gives ∥{right arrow over (P)}s _(in) −{right arrow over (P)} _(tgt)∥²=(c(t _(in) −t ₀)−∥{right arrow over (P)}s _(SSR) −{right arrow over (P)} _(tgt)∥)² ∥{right arrow over (P)}s _(in)∥²−2<{right arrow over (P)}s _(in) ,{right arrow over (P)}s _(tgt) >+∥{right arrow over (P)}s _(tgt)∥² =c ²(t _(in) −t ₀)²−2c(t _(in) −t ₀)∥{right arrow over (P)}s _(SSR) −{right arrow over (P)} _(tgt)∥+∥{right arrow over (P)}s _(SSR)∥²−2<{right arrow over (P)}s _(SSR) ,{right arrow over (P)}s _(tgt) >+∥{right arrow over (P)}s _(tgt)∥² ∥{right arrow over (P)}s _(in)∥²−2<{right arrow over (P)}s _(in) ,{right arrow over (P)}s _(tgt) >=c ²(t _(in) −t ₀)²−2c(t _(in) −t ₀)∥{right arrow over (P)}s _(SSR) −{right arrow over (P)} _(tgt) ∥+∥{right arrow over (P)}s _(SSR)∥²−2<{right arrow over (P)}s _(SSR) ,{right arrow over (P)}s _(tgt)>. Reorganizing the equation gives <−2{right arrow over (P)}s _(in) +{right arrow over (P)}s _(SSR) ,{right arrow over (P)}s _(tgt)>+2c(t _(in) −t ₀)∥{right arrow over (P)}s _(SSR) −{right arrow over (P)} _(tgt) ∥=c ²(t _(in) −t ₀)² −∥{right arrow over (P)}s _(in)∥² +∥{right arrow over (P)}s _(SSR)∥² Now, define a new variable {right arrow over (s)}r ₀ =∥{right arrow over (P)}s _(SSR) −{right arrow over (P)} _(tgt)∥.

This then allows the equations for in=1, . . . , Ns to be recast as a linear system of equations A₁{right arrow over (v)}₁=b₁

with the unknown vector defined as: ${\overset{->}{v}}_{1} = \begin{bmatrix} {\overset{\sim}{x}}_{tgt} \\ {\overset{\sim}{y}}_{tgt} \\ {\overset{\sim}{z}}_{tgt} \\ {\overset{\sim}{sr}}_{0} \end{bmatrix}$ and $A_{1} = \left\lbrack \quad\begin{matrix} {{{- 2}x_{1}} + {2x_{SSR}}} & {{{- 2}y_{1}} + {2y_{SSR}}} & {{{- 2}z_{1}} + {2z_{SSR}}} & {2{c\left( {t_{1} - t_{0}} \right)}} \\ \vdots & \vdots & \vdots & \vdots \\ {{{- 2}x_{in}} + {2x_{SSR}}} & {{{- 2}y_{in}} + {2y_{SSR}}} & {{{- 2}z_{in}} + {2z_{SSR}}} & {2{c\left( {t_{in} - t_{0}} \right)}} \\ \vdots & \vdots & \vdots & \vdots \\ {{{- 2}x_{Ns}} + {2x_{SSR}}} & {{{- 2}y_{Ns}} + {2y_{SSR}}} & {{{- 2}z_{Ns}} + {2z_{SSR}}} & {2{c\left( {t_{Ns} - t_{0}} \right)}} \end{matrix}\quad \right\rbrack$ $b_{1} = {\begin{bmatrix} {{c^{2}\left( {t_{1} - t_{0}} \right)}^{2} - {{\overset{->}{P}s_{1}}}^{2} + {{\overset{->}{P}s_{SSR}}}^{2}} \\ \vdots \\ {{c^{2}\left( {t_{in} - t_{0}} \right)}^{2} - {{\overset{->}{P}s_{in}}}^{2} + {{\overset{->}{P}s_{SSR}}}^{2}} \\ \vdots \\ {{c^{2}\left( {t_{Ns} - t_{0}} \right)}^{2} - {{\overset{->}{P}s_{Ns}}}^{2} + {{\overset{->}{P}s_{SSR}}}^{2}} \end{bmatrix}.}$

The method of least squares can be used to solve this linear system so that {right arrow over (v)} ₁=(A ₁ ^(T) P ⁻¹ A ₁)⁻¹ A ₁ ^(T) P ⁻¹ ·b ₁

where P is the measurement covariance matrix nominally set as identity matrix of dimension Ns×Ns.

Using Chan and Ho's technique, the covariance matrix H₁ of the error vector ev₁=A₁{right arrow over (v)}₁−b₁ is approximated from {right arrow over (v)}₁: H₁=c²C₁PC₁

where $C_{1} = \begin{bmatrix} {\overset{\sim}{sr}}_{1} & 0 & 0 & 0 & 0 \\ 0 & ⋰ & 0 & 0 & 0 \\ 0 & 0 & {\overset{\sim}{sr}}_{in} & 0 & 0 \\ 0 & 0 & 0 & ⋰ & 0 \\ 0 & 0 & 0 & \quad & {\overset{\sim}{sr}}_{Ns} \end{bmatrix}$ ${{\overset{\sim}{sr}}_{in} = {{{\overset{->}{P}s_{in}} - {\overset{\sim}{P}}_{tgt}}}},\quad{{\overset{\sim}{P}}_{tgt} = {\begin{bmatrix} {\overset{\sim}{x}}_{tgt} \\ {\overset{\sim}{y}}_{tgt} \\ {\overset{\sim}{z}}_{tgt} \end{bmatrix}.}}$

Now, a more refined solution vector is computed, if desired, by solving {right arrow over (v)} ₁=(A ₁ ^(T) H ₁ ⁻¹ A ₁)⁻¹ A ₁ ^(T) H ₁ ⁻¹ ·b ₁.

Once {right arrow over (v)}₁ is computed, a refinement step similar to the one employed by Chan and Ho, can be used to obtain a more accurate solution.

Consider a system: d ₁=(x _(SSR) −{tilde over (x)} _(tgt))², d ₂=(y _(SSR) −{tilde over (y)} _(tgt))², d ₃=(z _(SSR) −{tilde over (z)} _(tgt))², d ₁ +d ₂ +d ₃ =sr ₀ ⁻². As an over-determined linear system, A₂{right arrow over (v)}₂=b₂

where ${A_{2} = \begin{bmatrix} 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 \\ 1 & 1 & 1 & 1 \end{bmatrix}},\quad{{\overset{->}{v}}_{2} = \begin{bmatrix} d_{1} \\ d_{2} \\ d_{3} \end{bmatrix}},\quad{b_{2} = {\begin{bmatrix} \left( {x_{SSR} - {\overset{\sim}{x}}_{tgt}} \right)^{2} \\ \left( {y_{SSR} - {\overset{\sim}{y}}_{tgt}} \right)^{2} \\ \left( {z_{SSR} - {\overset{\sim}{z}}_{tgt}} \right)^{2} \\ {\overset{\sim}{sr}}_{0}^{2} \end{bmatrix}.\begin{matrix} \quad & \quad \\ \quad & \quad \\ \quad & \quad \end{matrix}}}$

As a least squares problem, the function to be minimized is LS=(h ₂ −A ₂ {right arrow over (v)} ₂)^(T) H ₂ ⁻¹(h ₂ −A ₂ {right arrow over (v)} ₂)

where the covariance matrix H₂ of error vector ev₂=A₂{right arrow over (v)}₂−b₂ is approximated by

H₂=4C₂F₁C₂ with $C_{2} = \begin{bmatrix} {x_{SSR} - {\overset{\sim}{x}}_{tgt}} & 0 & 0 & 0 \\ 0 & {y_{SSR} - {\overset{\sim}{y}}_{tgt}} & 0 & 0 \\ 0 & 0 & {y_{SSR} - {\overset{\sim}{y}}_{tgt}} & 0 \\ 0 & 0 & 0 & {\overset{\sim}{sr}}_{0} \end{bmatrix}$ and ${F_{1} = {\left( {A_{1}H_{1}^{- 1}A_{1}} \right)^{- 1}.{Thus}}},\begin{matrix} {{\overset{->}{v}}_{2} = {{\left( {A_{2}^{T}H_{2}^{- 1}A_{2}} \right)^{- 1} \cdot \left( {A_{2}^{T}H_{2}^{- 1}} \right)}h_{2}}} \\ {= {{\left( {{A_{2}^{T}\left( {C_{2}F_{1}C_{2}} \right)}^{- 1}A_{2}} \right)^{- 1} \cdot \left( {A_{2}^{T}\left( {C_{2}F_{1}C_{2}} \right)}^{- 1} \right)}h_{2}}} \\ {= {{\left( {{A_{2}^{T}\left( {{C_{2}\left( {A_{1}H_{1}^{- 1}A_{1}} \right)}^{- 1}C_{2}} \right)}^{- 1}A_{2}} \right)^{- 1} \cdot \left( {A_{2}^{T}\left( {{C_{2}\left( {A_{1}H_{1}^{- 1}A_{1}} \right)}^{- 1}C_{2}} \right)}^{- 1} \right)}h_{2}}} \\ {= {{\left( {{A_{2}^{T}\left( {{C_{2}^{- 1}\left( {A_{1}H_{1}^{- 1}A_{1}} \right)}C_{2}^{- 1}} \right)}A_{2}} \right)^{- 1} \cdot \left( {A_{2}^{T}\left( {{C_{2}^{- 1}\left( {A_{1}H_{1}^{- 1}A_{1}} \right)}C_{2}^{- 1}} \right)} \right)}h_{2}}} \end{matrix}$

Once {right arrow over (v)}₂ is computed, the refined solution to the object position is obtained: x _(tgt) =x _(SSR) ±√{square root over (d ¹ )} y _(tgt) =y _(SSR) ±√{square root over (d ² )}. z _(tgt) =z _(SSR) ±√{square root over (d ³ )}

There are eight possible solutions, and the one that is closest to the coarse solution [{tilde over (x)}_(tgt) {tilde over (y)}_(tgt) {tilde over (z)}_(tgt)]^(T) is selected as the object position.

The functional block diagram of the RTOA computation according to some embodiments is shown in FIG. 22. The steps of the RTOA computation can be summarized as follows.

After starting the computation at 2710, the position of the receive sensors, the time of arrival of the signal at the sensors, the position of the SSR radar, and the time of transmission of the interrogator signal are acquired as indicated at 2715. As indicated at 2720, a coarse position of the object is computed by solving {right arrow over (v)} ₁=(A ₁ ^(T) P ⁻¹ A ₁)⁻¹ A ₁ ^(T) P ⁻¹ ·b ₁.

At 2725, the approximated covariance matrix H₁ is computed from H₁=c²C₁PC₁.

At 2730, the coarse solution is refined by solving {right arrow over (v)} ₁=(A ₁ ^(T) H ₁ ⁻¹ A ₁)⁻¹ A ₁ ^(T) H ₁ ⁻¹ ·b ₁.

At 2735, all the possible refined solutions of the object position are then computed by solving {right arrow over (v)} ₂=(A ₂ ^(T)(C ₂ ⁻¹(A ₁ H ₁ ⁻¹ A ₁)C ₂ ⁻¹)A ₂)⁻¹·(A ₂ ^(T)(C ₂ ⁻¹(A ₁ H ₁ ⁻¹ A ₁)C ₂ ⁻¹)h ₂,

and, at 2740, using x _(tgt) =x _(SSR) ±√{square root over (e ¹ )} y _(tgt) =y _(SSR) ±√{square root over (e ² )}. z _(tgt) =z _(SSR) ±√{square root over (e ³ )}

At 2745, the refined solutions are compared with the coarse solution, and the one that is closest to the coarse solution is selected as the computed object position. At 2750 the computation ends.

Proceeding similarly to the TOA and CH TDOA methods above, the RTOA computation my be performed for a 2D case A Monte-Carlo, or other numerical approximation, approach is used so that the time of arrival data and the time of transmit of the interrogation signal have added Gaussian noise error: t _(in) =t _(—)0_(in) +N((σ₁)

where

t_(—)0_(in)=Actual time of arrival

N(σ₁)=Random Gaussian error of variance σ₁ ².

After multiple iterations, the RMS error is computed for each computation and then compared.

The TOA, CH TDOA and RTOA computations are applied to a 2-D case with three sensors. The sensors are positioned in units of miles at ${{\overset{->}{P}s_{1}} = \begin{bmatrix} 15 \\ 10 \end{bmatrix}},{{\overset{->}{P}s_{2}} = \begin{bmatrix} {- 15} \\ 10 \end{bmatrix}},{{\overset{->}{P}s_{3}} = {\begin{bmatrix} {- 15} \\ {- 10} \end{bmatrix}.}}$

The SSR is positioned at ${\overset{->}{P}\quad s_{SSR}} = {\begin{bmatrix} 0 \\ 0 \end{bmatrix}.}$

A grid covering the ±20 mile by ±20 mile region with 101 grid points along each side is used as object positions. For each grid node, the three computations are applied with 500 iterations to generate a set of error data so that the RMS error can be computed. The added Gaussian errors to the time of arrival data have the variance of $\sigma_{t}^{2} = {\left( \frac{10\quad{ft}}{c} \right)^{2}.}$

In FIG. 23, the resulting contours of the RMS errors for the three multilateration computations are shown. As shown, both the TOA and the TDOA computations have the same RMS errors, which are characterized by a region of very high errors behind the sensors. It is also clear that the RTOA computation gives much lower RMS error values, which implies greater accuracy.

The three multilateration computations are applied to a 2-D case with four sensors. The sensors are positioned in units of miles at ${{\overset{->}{P}\quad s_{1}} = \begin{bmatrix} 15 \\ 10 \end{bmatrix}},{{\overset{->}{P}\quad s_{2}} = \begin{bmatrix} {- 15} \\ 10 \end{bmatrix}},{{\overset{->}{P}\quad s_{3}} = \begin{bmatrix} {- 15} \\ {- 10} \end{bmatrix}},{{\overset{->}{P}\quad s_{4}} = {\begin{bmatrix} 15 \\ {- 10} \end{bmatrix}.}}$

The SSR is positioned at ${\overset{->}{P}\quad s_{SSR}} = {\begin{bmatrix} 0 \\ 0 \end{bmatrix}.}$

The same grid as described above is also used in this case, and the added Gaussian errors are set to be the same.

In FIG. 24, the resulting contours of the RMS errors for the three multilateration computations are shown. As shown, the TDOA computation is more accurate compared to the TOA computation in most areas except along the vertical and horizontal in the middle where the RMS errors are very large. This is likely due to the geometry of the set up in that along those two lines the matrix of the linear system is nearly singular. Similar to the previous case, the RTOA computation gives much lower RMS error values, which implies greater accuracy.

The three multilateration computations are applied to a 3-D case with four sensors. The sensors are positioned in units of miles at ${{\overset{\rightarrow}{P}s_{1}} = \begin{bmatrix} 15 \\ 10 \\ 0 \end{bmatrix}},{{\overset{\rightarrow}{P}s_{2}} = \begin{bmatrix} {- 15} \\ 10 \\ 0.1 \end{bmatrix}},{{\overset{\rightarrow}{P}s_{3}} = \begin{bmatrix} {- 15} \\ 10 \\ 0.2 \end{bmatrix}},{{\overset{\rightarrow}{P}s_{4}} = {\begin{bmatrix} 15 \\ {- 10} \\ 0.3 \end{bmatrix}.}}$

The SSR is positioned at ${\overset{\rightarrow}{P}s_{SSR}} = {\begin{bmatrix} 0 \\ 0 \\ 0 \end{bmatrix}.}$

A grid covering the ±20 mile by ±20 mile region with 101 grid points along the x- and y-axis positioned at the z-axis height of 10 miles is used as object positions; and for each grid node, the three computations are applied with 500 iterations to generate a set of error data so that the RMS error can be computed. The added Gaussian errors to the time of arrival data have the variance of $\sigma_{t}^{2} = {\left( \frac{10\quad{ft}}{c} \right)^{2}.}$

In FIG. 25, the resulting contours of the RMS errors for the three multilateration computations are shown. As shown, both the TOA and the TDOA computations have the same RMS errors. It is also clear as before that the RTOA computation gives much lower RMS error values, which implies greater accuracy.

The RTOA computation appears to work better than the previously discussed TOA and TDOA computation in the test cases that are studied here. Adding the time of transmission of the interrogator signal from the SSR appears to greatly increase the accuracy of the new multilateration scheme. On the other hand, it is not always clear how to obtain to for some cases. One possible solution is if the return from the transponder also includes information about to, then the RTOA computation could work well.

The invention now being fully described, it will be apparent to one of ordinary skill in the art that many changes and modifications can be made thereto without departing from the spirit or scope of the invention as set forth herein. The foregoing describes the preferred embodiments of the present invention along with a number of possible alternatives. These embodiments, however, are merely for example and the invention is not restricted thereto. It will be recognized that various materials and modifications may be employed without departing from the invention described above, the scope of which is set forth in the following claims. 

1-9. (canceled)
 10. A method for determining the position of an object in a system comprising a sensor arranged at a determinable location, the method comprising: obtaining a time of arrival for a signal received at the sensor calculating a slant range from the object to the sensor based, at least in part, upon the obtained time of arrival; wherein calculating the slant range further comprises: adding a known distribution of noise to the time of arrival; prior to calculating the slant range; and determining a position vector based, at least in part, upon the calculated slant range and the location of the sensor.
 11. The method of claim 10 wherein the time of arrival is obtained from a signal transmitted from the object.
 12. The method of claim 10 wherein the time of arrival is obtained from a signal reflected from the object.
 13. (canceled)
 14. The method of claim 10 wherein the known distribution of noise comprises a Gaussian noise distribution with a variance of σ².
 15. The method of claim 10 wherein determining a position vector further comprises: calculating an error norm for each possible position vector solution; and selecting as the object position vector the position vector solution with the smallest error norm. 16-19. (canceled) 